class Task61:
    def run(self, array):
        array = sorted(array)
        i = 0

        zero_count = 0
        while i < len(array) and array[i] == 0:
            zero_count += 1
            i += 1

        i += 1      # point to the second number that is not zero
        missing = 0
        while i < len(array):
            if array[i] == array[i - 1]:
                return False
            missing += (array[i] - array[i - 1] - 1)
            i += 1

        if zero_count >= missing:
            return True
        return False
